CSE 190, Great ideas in algorithms: Pairwise independent hash functions

ثبت نشده
چکیده

The goal of hash functions is to map elements from a large domain to a small one. Typically, to obtain the required guarantees, we would need not just one function, but a family of functions, where we would use randomness to sample a hash function from this family. Let H = {h : U → R} be a family of functions, mapping elements from a (large) universe to a (small) range. Ideally, we would like to obtain certatin “random-like” properties of this family, while keeping its size small. This will be important for applications in data structures and streaming algorithms, where we would need to keep a “seed” which tells us which hash function we chose, as well as in de-randomization, where we can replace true random with pseudo-randomness, obtained via enumerating all the hash functions in a family. We start with describing one of the more basic but very useful properties we can require from hash functions, that of being pairwise-independent.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

CSE 190, Great ideas in algorithms: Expander graphs

Our interest however will be in constructing large but very sparse graphs (ideally with d = 3) for which h(G) ≥ c for some absolute constant c > 0. Such graphs are “highly connected” graphs. For example, the following lemma shows that by deleting a few edges in such graphs, we can only disconnect a few vertices. This is very useful for example in network design, where we want the failure of edg...

متن کامل

CSE 599 b : Cryptography ( Winter 2006 ) Lecture 14 : Cryptographic Hash Functions 17 February 2006

and thus being a universal hash function family is equivalent to having a probability distribution on functions from D to R that maps elements of D in a uniform pairwise independent fashion. Typically we will consider D = {0, 1} and R = {0, 1} form < n. The following construction due to Dietzfelbinger is particularly convenient: The space of keys is all strings K = (a, b) where a, b ∈ {0, 1} an...

متن کامل

2 Pairwise Independent Hash Functions 2.1 Extending the Construction from Last Time

Today we will define the notion of a pairwise independent hash function, and discuss its applications in randomness-efficient error reduction and interactive proofs. Randomness-efficient error reduction is the topic of studying algorithms for amplifying the success probability (equivalently, reducing the error probability) of an RP algorithm by running the algorithm many times, each with a new ...

متن کامل

The universality of iterated hashing over variable-length strings

Iterated hash functions process strings recursively, one character at a time. At each iteration, they compute a new hash value from the preceding hash value and the next character. We prove that iterated hashing can be pairwise independent, but never 3wise independent. We show that it can be almost universal over strings much longer than the number of hash values; we bound the maximal string le...

متن کامل

Low-density Parity Constraints for Hashing-Based Discrete Integration

In recent years, a number of probabilistic inference and counting techniques have been proposed that exploit pairwise independent hash functions to infer properties of succinctly defined high-dimensional sets. While providing desirable statistical guarantees, typical constructions of such hash functions are themselves not amenable to efficient inference. Inspired by the success of LDPC codes, w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015